Semi-Supervised Learning Using Kernel Spectral Clustering Core Model

نویسندگان

  • Siamak Mehrkanoon
  • Johan A.K. Suykens
چکیده

A multi-class semi-supervised learning algorithm formulated as a regularized kernel spectral clustering (KSC) approach is proposed. The method is bale to address both semi-supervised classification and clustering. In addition a low embedding dimension is utilized to reveal the existing number of clusters. Thanks to the Nyström approximation technique, the approach can be scaled up for analyzing large scale datasets. The model is trained using a training dataset and the class/cluster membership of the test data points are estimated using the out-of-sample extension property of the model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composite Kernel Optimization in Semi-Supervised Metric

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

متن کامل

The Hong Kong Baptist University Adapting Kernel-based Methods to Semi-supervised Learning: from Multi-class Svm to Spectral Analysis a Research Prospectus Submitted to the Thesis Committee for Pursuing the Degree of Master of Philosophy Department of Computer Science by Wu Zhili

This prospectus proposes a preliminary research topic about fusing the kernel-based SVM method and the similarity-based spectral clustering into a semi-supervised learning algorithm under the scope of learning from both labeled and unlabeled data. For the past nine months before the prospectus comes out, much effort has been put to extend the bloomed SVM to more practicable multi-class learning...

متن کامل

Semi - Supervised Learning Based on Kernel Methods and Graph Cut Algorithms

In this thesis, we discuss the application of established and advanced optimization techniques in a variety of machine learning problems. More specifically, we demonstrate how fast optimization methods can be of use for the identification of classes or clusters in sets of data points, and this in general semi-supervised learning settings, where the learner is provided with some form of class in...

متن کامل

Hierarchical and Reweighting Cluster Kernels for Semi-Supervised Learning

Abstract: Recently semi-supervised methods gained increasing attention and many novel semi-supervised learning algorithms have been proposed. These methods exploit the information contained in the usually large unlabeled data set in order to improve classification or generalization performance. Using data-dependent kernels for kernel machines one can build semi-supervised classifiers by buildin...

متن کامل

A Semi-Supervised Approach for Kernel-Based Temporal Clustering

Temporal clustering refers to the partitioning of a time series into multiple nonoverlapping segments that belong to k temporal clusters, in such a way that segments in the same cluster are more similar to each other than to those in other clusters. Temporal clustering is a fundamental task in many fields, such as computer animation, computer vision, health care, and robotics. The applications ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015